Computation of the Network Reliability
نویسندگان
چکیده
It is known that a certain case of the all-terminal network reliability can be computed via the Tutte polynomial which is an invariant in graph theory. Recently, we have proposed a new approach of computing the Tutte polynomial of a graph of moderate size [9]. In this paper, by using it we analyze computation method of the general all-terminal network reliability and two-terminal network reliability with di erent edge deletion probability. In addition, to obtain the upper bound for the all-terminal network reliability, the polynomial-time algorithm of computing the Tutte polynomial for a complete graph [1] is applied to compute that reliability for a complete graph.
منابع مشابه
Tenacity and rupture degree parameters for trapezoid graphs
Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملMonte Carlo Simulation to Compare Markovian and Neural Network Models for Reliability Assessment in Multiple AGV Manufacturing System
We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...
متن کاملLearning Curve Consideration in Makespan Computation Using Artificial Neural Network Approach
This paper presents an alternative method using artificial neural network (ANN) to develop a scheduling scheme which is used to determine the makespan or cycle time of a group of jobs going through a series of stages or workstations. The common conventional method uses mathematical programming techniques and presented in Gantt charts forms. The contribution of this paper is in three fold. First...
متن کاملAn Enhanced HL-RF Method for the Computation of Structural Failure Probability Based On Relaxed Approach
The computation of structural failure probability is vital importance in the reliability analysis and may be carried out on the basis of the first-order reliability method using various mathematical iterative approaches such as Hasofer-Lind and Rackwitz-Fiessler (HL-RF). This method may not converge in complicated problems and nonlinear limit state functions, which usually shows itself in the f...
متن کامل